Nonlinear least squares algorithm for identification of hazards
نویسندگان
چکیده
منابع مشابه
Least-Squares-Based Iterative Identification Algorithm for Wiener Nonlinear Systems
This paper focuses on the identification problem ofWiener nonlinear systems.The application of the key-term separation principle provides a simplified form of the estimated parameter model. To solve the identification problem of Wiener nonlinear systems with the unmeasurable variables in the information vector, the least-squares-based iterative algorithm is presented by replacing the unmeasurab...
متن کاملNewton-Krylov Type Algorithm for Solving Nonlinear Least Squares Problems
The minimization of a quadratic function within an ellipsoidal trust region is an important subproblem for many nonlinear programming algorithms. When the number of variables is large, one of the most widely used strategies is to project the original problem into a small dimensional subspace. In this paper, we introduce an algorithm for solving nonlinear least squares problems. This algorithm i...
متن کاملA recursive algorithm for nonlinear least-squares problems
The solution of nonlinear least-squares problems is investigated. The asymptotic behavior is studied and conditions for convergence are derived. To deal with such problems in a recursive and efficient way, it is proposed an algorithm that is based on a modified extended Kalman filter (MEKF). The error of the MEKF algorithm is proved to be exponentially bounded. Batch and iterated versions of th...
متن کاملAn Efficient Algorithm for the Separable Nonlinear Least Squares Problem
The nonlinear least squares problem miny,z‖A(y)z + b(y)‖, where A(y) is a full-rank (N + `)× N matrix, y ∈ Rn, z ∈ RN and b(y) ∈ RN+` with ` ≥ n, can be solved by first solving a reduced problem miny‖ f (y)‖ to find the optimal value y∗ of y, and then solving the resulting linear least squares problem minz‖A(y∗)z + b(y∗)‖ to find the optimal value z∗ of z. We have previously justified the use o...
متن کاملNew Convergence Results for the Least Squares Identification Algorithm
Abstract: The basic least squares method for identifying linear systems has been extensively studied. Conditions for convergence involve issues about noise assumptions and behavior of the sample covariance matrix of the regressors. Lai and Wei proved in 1982 convergence for essentially minimal conditions on the regression matrix: All eigenvalues must tend to infinity, and the logarithm of the l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cogent Mathematics
سال: 2015
ISSN: 2331-1835
DOI: 10.1080/23311835.2015.1118219